Optimal Broadcasting Strategies for Conjunctive Queries over Distributed Data
نویسندگان
چکیده
منابع مشابه
Distributed Processing of Conjunctive Queries
We distinguish that Web query processing is composed of two phases: (a) retrieving information on documents related to the queries and ranking them, and (b) generating snippets, title, and URL information for the answer page. Using real data and a small cluster of index servers, we study four basic and key issues related to this first phase of query processing: load balance, broker behavior, pe...
متن کاملData complexity of answering conjunctive queries over SHIQ knowledge bases
In [6] the authors give an algorithm for answering conjunctive queries over ALCN R knowledge bases which is coNP in data complexity. Their technique is based on the tableau technique for checking sat-isfiability in ALCN R presented in [2]. In their algorithm, the blocking conditions of [2] are weakened in such a way that the set of models their algorithm yields suffices to check query entailmen...
متن کاملAnswering Arbitrary Conjunctive Queries over Incomplete Data Stream Histories
Streams of data often originate from many distributed sources. A user wanting to query the streams should not need to know from where each stream originates but should be provided with a global view of the streams. R-GMA is a system that integrates distributed data streams to provide a global view of all the streams for users to query. R-GMA has been developed as a grid information and monitori...
متن کاملContainment of Conjunctive Queries over Conceptual Schemata
Conceptual Modelling plays a fundamental role in database design since Chen’s Entity-Relationship (ER) model. In this paper we consider a conceptual model capable of capturing classes of objects with their attributes, relationships among classes, cardinality constraints in the participation of entities to relationships, and is-a relations among both classes and relationships. We provide a forma...
متن کاملVertically Acyclic Conjunctive Queries over Trees
Seeking a manageable subclass of conjunctive queries over trees that would reach beyond tree patterns, we find that vertical acyclicity of queries is sufficient to guarantee the same complexity bounds for static analysis problems, as those enjoyed by tree patterns.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theory of Computing Systems
سال: 2016
ISSN: 1432-4350,1433-0490
DOI: 10.1007/s00224-016-9719-8